NOËL LAVERNY and JÉRÔME LANG FROM KNOWLEDGE-BASED PROGRAMS TO GRADED
نویسندگان
چکیده
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at execution time. However, branching conditions in KBPs cannot refer to possibly erroneous beliefs or to graded belief, such as “if my belief that φ holds is high then do some action α else perform some sensing action β”. The purpose of this paper is to build a framework where such programs can be expressed. In this paper we focus on the execution of such a program (a companion paper investigates issues relevant to the off-line evaluation and construction of such programs). We define a simple graded version of doxastic logic KD45 as the basis for the definition of belief-based programs. Then we study the way the agent’s belief state is maintained when executing such programs, which calls for revising belief states by observations (possibly unreliable or imprecise) and progressing belief states by physical actions (which may have normal as well as exceptional effects).
منابع مشابه
NOËL LAVERNY and JÉRÔME LANG FROM KNOWLEDGE-BASED PROGRAMS TO GRADED BELIEF-BASED PROGRAMS, PART I: ON-LINE REASONING∗
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at execution time. However, branching conditions in KBPs cannot refer to possibly erroneous beliefs or to graded belief, such as “if my belief that φ holds is high then do some action α else perform some sensing action β”...
متن کاملFrom knowledge-based programs to graded belief-based programs, part II: off-line reasoning
Belief-based programs generalize knowledgebased programs [Fagin et al., 1995] by allowing for incorrect beliefs, unreliable observations, and branching conditions that refer to implicit graded beliefs, such as in “while my belief about the direction to the railway station is not strong enough do ask someone”. We show how to reason off-line about the possible executions of a belief-based program...
متن کاملModeling Belief Change on Epistemic States
Belief revision always results in trusting new evidence, so it may admit an unreliable one and discard a more confident one. We therefore use belief change instead of belief revision to remedy this weakness. By introducing epistemic states, we take into account of the strength of evidence that influences the change of belief. In this paper, we present a set of postulates to characterize belief ...
متن کاملThe ecosystem of knowledge-based development” and employment of higher education graduates
The employment of higher education graduates (EHEG) in Iran is not desirable. Policymakers and executives of economic programs attribute this to the oversupply and poor quality of university graduates. On the other hand, policymakers and implementers of higher education programs attribute this to the low demand of the Iranian economy for higher education graduates. Although both arguments are ...
متن کاملKnowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence (Extended Abstract)∗
Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing action policies in AI planning has been surprisingly overlooked. Given that to each KBP corresponds an equivalent plan and vice versa, KBPs are typically more succinct than standard plans, but imply more on-line computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006